Successive Secret Key Agreement over Generalized Multiple Access and Broadcast Channels
نویسندگان
چکیده
A secret key agreement framework between three users is considered in which each of the users 1 and 2 intends to share a secret key with user 3 and users 1 and 2 are eavesdroppers with respect to each other. There is a generalized discrete memoryless multiple access channel (GDMMAC) from users 1 and 2 to user 3 where the three users receive outputs from the channel. Furthermore, there is a broadcast channel (BC) from user 3 to users 1 and 2. Secret key sharing is intended where GDMMAC and BC can be successively used. In this framework, an inner bound of the secret key capacity region is derived. Moreover, for a special case where the channel inputs and outputs of the GDMAC and the BC form Markov chains in some order, the secret key capacity region is derived. Also the results are discussed through a binary example.
منابع مشابه
Strong Secrecy in Pairwise Key Agreement over a Generalized Multiple Access Channel
This paper considers the problem of pairwise key agreement without public communication between three users connected through a generalized multiple access channel (MAC). While two users control the channel inputs, all three users observe noisy outputs from the channel and each pair of users wishes to agree on a secret key hidden from the remaining user. We first develop a “pre-generated” key-a...
متن کاملInformation-Theoretic Key Agreement of Multiple Terminals - Part II: Channel Model
This is the second part of a two-part paper on information-theoretically secure secret key agreement. This part covers the secret key capacity under the channel model. In this model, multiple terminals wish to create a shared secret key that is secure from an eavesdropper with unlimited computational resources. The terminals are all connected to a noiseless and authenticated but unsecure channe...
متن کاملUnconditionally Secure Secret-key Agreement and the Intrinsic Conditional Mutual Information
This paper is concerned with secret-key agreement by public discussion: two parties Alice and Bob and an adversary Eve have access to independent realizations of random variables X, Y , and Z, respectively, with joint distribution P XY Z. The secret key rate S(X; Y jjZ) has been deened as the maximal rate at which Alice and Bob can generate a secret key by communication over an insecure, but au...
متن کاملUnconditionally Secure Key Agreement And The Intrinsic Conditional Information - Information Theory, IEEE Transactions on
This paper is concerned with secret-key agreement by public discussion. Assume that two parties Alice and Bob and an adversary Eve have access to independent realizations of random variables X , Y , and Z, respectively, with joint distribution PXY Z . The secret-key rate S(X;Y kZ) has been defined as the maximal rate at which Alice and Bob can generate a secret key by communication over an inse...
متن کاملUnconditionally Secure Key Agreement and the Intrinsic Conditional Information
This paper is concerned with secret-key agreement by public discussion. Assume that two parties Alice and Bob and an adversary Eve have access to independent realizations of random variables X, Y , and Z, respectively, with joint distribution P XY Z. The secret key rate S(X; Y jjZ) has been deened as the maximal rate at which Alice and Bob can generate a secret key by communication over an inse...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1202.1387 شماره
صفحات -
تاریخ انتشار 2012